Augmenting Weighted Average with Confusion Matrix to Enhance Classification Accuracy
نویسندگان
چکیده
منابع مشابه
Using Hierarchical Clustering to Enhance Classification Accuracy
A new approach to classification is presented based on COBWEB, an unsupervised conceptual clustering algorithm. The modifications proposed improved the classification accuracy by 2.32% and up to 7.25% in the Period Disambiguation system that was built in order to test the efficiency of the approach. The system can be trained across different domains and languages. It has been tested on the Brow...
متن کاملConfusion Matrix Stability Bounds for Multiclass Classification
We provide new theoretical results on the generalization properties of learning algorithms for multiclass classification problems. The originality of our work is that we propose to use the confusion matrix of a classifier as a measure of its quality; our contribution is in the line of work which attempts to set up and study the statistical properties of new evaluation measures such as, e.g. ROC...
متن کاملLinear discriminant feature extraction using weighted classification confusion information
Linear discriminant analysis (LDA) can be viewed as a twostage procedure geometrically. The first stage conducts an orthogonal and whitening transformation of the variables. The second stage involves a principal component analysis (PCA) on the transformed class means, which is intended to maximize the class separability along the principal axes. In this paper, we demonstrate that the second sta...
متن کاملConfusion Matrix
A confusion matrix (Kohavi and Provost, 1998) contains information about actual and predicted classifications done by a classification system. Performance of such systems is commonly evaluated using the data in the matrix. The following table shows the confusion matrix for a two class classifier. The entries in the confusion matrix have the following meaning in the context of our study: ● a is ...
متن کاملChoosing Subsets with Maximum Weighted Average
Given a set of n real values, each with a positive weight, we wish to find the subset of n− k values having maximum weighted average. This is equivalent to the following form of parametric selection: given n objects with values decreasing linearly with time, find the time at which the n− k maximum values add to zero. We show that these problems can be solved in time O(n) (independent of k). A g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions on Machine Learning and Artificial Intelligence
سال: 2014
ISSN: 2054-7390
DOI: 10.14738/tmlai.24.328